ABC139 C - Lower
https://atcoder.jp/contests/abc139/tasks/abc139_c
提出
code: python
n = int(input())
h = list(map(int, input().split()))
ans = []
res = 0
if (n == 1):
print(0)
else:
for i in range(n-1):
if (hi+1 <= hi):
res += 1
else:
res = 0
ans.append(res)
print(max(ans))
メモ
n == 1がコーナーケース